Algebraic and Cost-based Optimization of Refactoring Sequences
نویسندگان
چکیده
Software product lines comprise techniques to tailor a program by selecting features. Selected features translate into sequenced program transformations which extend a base program. However, a sequence translated from the user selection can be inefficient to execute. In this paper, we show how we optimize sequences of refactoring transformations to reduce the composition time for product line programs.
منابع مشابه
The Design of the Best Heat Integrated Separation Systems Using Harmony Search Algorithm
The synthesis of heat integrated multi-component distillation systems is complex due to its huge search space for structural combination and optimization computation. To provide a systematic approach and tools for the synthesis design of distillation systems, a new method for modeling heat integrated columns is presented, and the operating cost objective function is minimized by improved harmon...
متن کاملSearch-based and goal-oriented refactoring using unfolding of graph transformation systems
To improve automation and traceability of search-based refactoring, in this thesis we propose a formulation of using graph transformation, where graphs represent object-oriented software architectures at the class level and rules describe refactoring operations. This formalisation allows us to make use of partial order semantics and an associated analysis technique, the approximated unfolding o...
متن کاملOptimization of Hybrid Composite Laminate Based on the Frequency using Imperialist Competitive Algorithm
Imperialist competitive algorithm (ICA) is a new socio-politically motivated global search strategy. The ICA is applied to hybrid composite laminates to obtain minimum weight and cost. The approach which is chosen for conducting the multi-objective optimization was the weighted sum method (WSM). The hybrid composite Laminates are made of glass/epoxy and carbon/epoxy to combine the lightness and...
متن کاملFirst Results on the Evolutionary Solution for the Strategy- based Refactoring Set Selection Problem
In order to improve the internal structure of object-oriented software, refactoring has proved to be a feasible technique. Scheduling a refactoring process for a complex software system is a difficult task to do. Refactorings may be organized and prioritized based on goals established by the project management leadership, that shapes a refactoring strategy. The paper presents a multi-objective ...
متن کاملOptimization of Complex SPARQL Analytical Queries
Analytical queries are crucial for many emerging Semantic Web applications such as clinical-trial recruiting in Life Sciences that incorporate patient and drug profile data. Such queries compare aggregates over multiple groupings of data which pose challenges in expression and optimization of complex grouping-aggregation constraints. While these challenges have been addressed in relational mode...
متن کامل